CYCLES AND 1-UNCONDITIONAL MATRICES
نویسندگان
چکیده
منابع مشابه
Cycles and 1-unconditional matrices
We characterize the 1-unconditional subsets (erc)(r,c)∈I of the set of elementary matrices in the Schatten-von-Neumann class S. The set of couples I must be the set of edges of a bipartite graph without cycles of even length 4 6 l 6 p if p is an even integer, and without cycles at all if p is a positive real number that is not an even integer. In the latter case, I is even a Varopoulos set of V...
متن کاملZPC Matrices and Zero Cycles
Let H be an m × n real matrix and let Zi be the set of column indices of the zero entries of row i of H. Then the conditions |Zk ∩ ∪k−1 i 1 Zi | ≤ 1 for all k 2 ≤ k ≤ m are called the row Zero Position Conditions ZPCs . If H satisfies the ZPC, then H is said to be a row ZPC matrix. If H satisfies the ZPC, thenH is said to be a column ZPCmatrix. The real matrixH is said to have a zero cycle if H...
متن کاملCircular law for random matrices with unconditional log-concave distribution
We explore the validity of the circular law for random matrices with non i.i.d. entries. Let A be a random n×n real matrix having as a random vector in Rn×n a log-concave isotropic unconditional law. In particular, the entries are uncorellated and have a symmetric law of zero mean and unit variance. This allows for some dependence and non equidistribution among the entries, while keeping the sp...
متن کاملA ug 1 99 4 UNCONDITIONAL BASES AND UNCONDITIONAL FINITE - DIMENSIONAL DECOMPOSITIONS IN BANACH SPACES
Let X be a Banach space with an unconditional finite-dimensional Schauder decomposition (E n). We consider the general problem of characterizing conditions under which one can construct an unconditional basis for X by forming an unconditional basis for each E n. For example, we show that if sup dim E n < ∞ and X has Gordon-Lewis local unconditional structure then X has an unconditional basis of...
متن کاملHamilton cycles in digraphs of unitary matrices
A set S ⊆ V is called an q-set (q−-set, respectively) if S has at least two vertices and, for every u ∈ S, there exists v ∈ S, v 6= u such that N(u) ∩ N(v) 6= ∅ (N−(u)∩N−(v) 6= ∅, respectively). A digraph D is called s-quadrangular if, for every q-set S, we have | ∪ {N+(u) ∩ N(v) : u 6= v, u, v ∈ S}| ≥ |S| and, for every q−set S, we have | ∪ {N−(u) ∩ N−(v) : u, v ∈ S)} ≥ |S|. We conjecture that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2006
ISSN: 0024-6115,1460-244X
DOI: 10.1017/s0024611506015899